Minimizing Regret When Dissolving a Partnership
نویسندگان
چکیده
منابع مشابه
Minimizing Regret when Dissolving a Partnership
We study the problem of dissolving an equal-entitlement partnership when the objective is to minimize maximum regret. We initially focus on the family of linear-pricing mechanisms and derive regret-optimizing strategies. We also demonstrate that there exist linear-pricing mechanisms satisfying ex-post efficiency. Next, we analyze a binary-search mechanism which is ex-post individually rational....
متن کاملDissolving a partnership dynamically
In financial disputes arising from divorce, inheritance, or the dissolution of a partnership, frequently the need arises to assign ownership of an indivisible item to one member of a group. This paper introduces and analyzes a dynamic auction for simply and e¢ciently allocating an item when participants are privately informed of their values. In the auction, the price rises continuously. A bidd...
متن کاملDissolving a Partnership Efficiently
Several partners jointly own an asset that may be traded among them. Each partner has a valuation for the asset; the valuations are known privately and drawn independently from a common probability distribution. We characterize the set of all incentive-compatible and interim-individually-rational trading mechanisms, and give a simple necessary and sufficient condition for such mechanisms to dis...
متن کاملMinimizing Regret with Multiple
We study the problem of computing and learning non-anonymous reserve prices to maximize revenue. We first define the MAXIMIZING MULTIPLE RESERVES (MMR) problem in single-parameter matroid environments, where the input is m valuation profiles v1, . . . ,vm, indexed by the same n bidders, and the goal is to compute the vector r of (non-anonymous) reserve prices that maximizes the total revenue ob...
متن کاملRegret-Minimizing Representative Databases
We propose the k-representative regret minimization query (k-regret) as an operation to support multi-criteria decision making. Like top-k, the k-regret query assumes that users have some utility or scoring functions; however, it never asks the users to provide such functions. Like skyline, it filters out a set of interesting points from a potentially large database based on the users’ criteria...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2008
ISSN: 1556-5068
DOI: 10.2139/ssrn.1322066